Decidability and Complexity for Quiescent Consistency and its Variations
نویسندگان
چکیده
Quiescent consistency is a notion of correctness for a concurrent object that gives meaning to the objects behaviours in quiescent states, i.e., states in which none of the objects operations are being executed. Correctness of an implementation object is defined in terms of a corresponding abstract specification. This gives rise to two important verification questions: membership (checking whether a behaviour of the implementation is allowed by the specification) and correctness (checking whether all behaviours of the implementation are allowed by the specification). In this paper, we show that the membership problem for quiescent consistency is NP-complete and that the correctness problem is decidable, but coNP-hard and in EXPSPACE. For both problems, we consider restricted versions of quiescent consistency by assuming an upper limit on the number of events between two quiescent points. Here, we show that the membership problem is in PTIME, whereas correctness is in PSPACE. Quiescent consistency does not guarantee sequential consistency, i.e., it allows operation calls by the same process to be reordered when mapping to an abstract specification. Therefore, we also consider quiescent sequential consistency, which strengthens quiescent consistency with an additional sequential consistency condition. We show that the unrestricted versions of membership and correctness are NPcomplete and undecidable, respectively. When by placing a limit on the number of events between two quiescent points, membership is in PTIME, while correctness is in PSPACE. Finally, we consider a version of quiescent sequential consistency that places an upper limit on the number of processes for every run of the implementation, and show that the membership problem for quiescent sequential consistency with this restriction is in PTIME.
منابع مشابه
Effect of impeller speed on properties of quiescent zone and entrainment in mechanical flotation cells
Flotation process in mechanical cells is carried out in highly turbulent conditions. In this work, the impact of impeller speed on four characteristics of the quiescent zone, i.e. zone height, turbulence, solid percentage, and gas holdup, and their relationship with the entrainment is investigated, and it is shown why at a higher impeller speed, entrainment is not significant. The height of the...
متن کاملQuasi-Digital Low-Dropout Voltage Regulator uses Controlled Pass Transistors
This article presents a low quiescent current outputcapacitorless quasi-digital CMOS LDO regulator with controlled pass transistors according to load demands. The pass transistor of the LDO is broken up to two smaller sizes based on a breakup criterion defined here, which considers the maximum output voltage variations to different load current steps to find the suitable current boundary for br...
متن کاملDocument Verification with Temporal Description Logics
The subject of this thesis is checking the content consistency of web documents along reading paths. Web documents are typically not read linearly but by following different alternative paths through the content. Manually ensuring the consistency of content along the possible reading paths is difficult, time-consuming, and error-prone. Tool support is highly desirable. This thesis presents a ne...
متن کاملPhase-Destabilization Mechanism of Polymer-Modified Bitumens in Quiescent Annealing
Bitumen as a binder in coating and insulating materials is modified with polymers to improve its performance in service conditions. Almost all polymers are incompatible with bitumen, and at high temperatures due to relatively very low viscosity of the bitumen phase, are separated from it. These lead to a considerable limitation in the use and handling of polymer-modified bitumens. An understand...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 257 شماره
صفحات -
تاریخ انتشار 2017